Limits for Queues as the Waiting Room Grows

نویسندگان

  • Daniel P. Heyman
  • Ward Whitt
چکیده

We study the convergence of finite-capacity open queueing systems to their infinite-capacity counterparts as the capacity increases. Convergence of the transient behavior is easily established in great generality provided that the finite-capacity system can be identified with the infinitecapacity system up to the first time that the capacity is exceeded. Convergence of steady-state distribution is more difficult; it is established here for single-facility models such as GI/GI/c/n with c servers, n − c extra waiting space and the first-come first-served discipline, in which all arrivals finding the waiting room full are lost without affecting future arrivals, via stability properties of generalized semi-Markov processes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Time-Varying Queues

Service systems abound with queues, but the most natural direct models are often timevarying queues, which require nonstandard analysis methods beyond stochastic textbooks. This paper surveys the literature on time-varying queues. Most of the literature concerns manyserver queues, which arise in large-scale service systems, such as in customer contact centers and hospital emergency departments,...

متن کامل

Heavy-Traffic Limits for Loss Proportions in Single-Server Queues

We establish heavy-traffic stochastic-process limits for the queue-length and overflow stochastic processes in the standard single-server queue with finite waiting room (G/G/1/K). We show that, under regularity conditions, the content and overflow processes in related single-server models with finite waiting room, such as the finite dam, satisfy the same heavy-traffic stochastic-process limits....

متن کامل

A Mathematical Analysis on Linkage of a Network of Queues with Two Machines in a Flow Shop including Transportation Time

This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...

متن کامل

Heavy-traffic Limits for Waiting times in Many-server Queues with Abandonment1 by Rishi Talreja

We establish heavy-traffic stochastic-process limits for waiting times in many-server queues with customer abandonment. If the system is asymptotically critically loaded, as in the quality-and-efficiency-driven (QED) regime, then a bounding argument shows that the abandonment does not affect waiting-time processes. If instead the system is overloaded, as in the efficiency-driven (ED) regime, fo...

متن کامل

Heavy-traffic Limits for Waiting times in Many-server Queues with Abandonment

We establish heavy-traffic stochastic-process limits for waiting times in many-server queues with customer abandonment. If the system is asymptotically critically loaded, as in the quality-and-efficiencydriven (QED) regime, then a bounding argument shows that the abandonment does not affect waiting-time processes. If instead the system is overloaded, as in the efficiency-driven (ED) regime, fol...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Queueing Syst.

دوره 5  شماره 

صفحات  -

تاریخ انتشار 1989